Algorithms and Assessment in Computer Poker

نویسندگان

  • Darse Billings
  • Jonathan Schaeffer
  • Eileen Billings
چکیده

The game of poker offers a clean well-defined domain in which to investigate some truly fundamental issues in computing science, such as how to handle deliberate misinformation, and how to make intelligent guesses based on partial knowledge. In the taxonomy of games, poker lies at the opposite end of the spectrum from well-studied board games like checkers and chess. Poker is a multi-player game with stochasticity (random events occurring over a known probability distribution), imperfect information (some information is hidden from each player), and partially observable outcomes (some information might never be known). Consequently, the use of deception, opponent modeling, and coping with uncertainty are indispensable elements of high-level strategic play. Traditional methods for computer game-playing are incapable of handling these properties. Writing a program to play a skillful game of poker is a challenging proposition from an engineering perspective as well, since each decision must be made quickly (typically about one second). A major theme of this dissertation is the evolution of architectures for poker-playing programs that has occurred since the research began in 1992. Four distinct approaches we address are: knowledge-based systems, simulation, game-theoretic methods, and adaptive imperfect information game-tree search. Each phase of the research explored the strengths and weaknesses of the corresponding architectures, both in theory and in practice. The important problem of obtaining an accurate assessment of performance is also addressed. The creation of a powerful tool for this purpose, called DIVAT, is discussed in detail. The academic papers arising from each of these studies constitute the core chapters of this thesis. The conclusion discusses some of the advantages and shortcomings of each approach, along with the most valuable lessons learned in the process. Although the goal of surpassing all human players has not yet been attained, the path has been cleared. The best poker programs are beginning to pose a serious threat, even in this most “human” of games. As programs continue to improve, they provide new insights into poker strategy, and valuable lessons on how to handle various forms of uncertainty.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An Adaptive Learning Model for Simplified Poker Using Evolutionary Algorithms

Evolution is the process of adapting to a potentially dynamic environment. By utilising the implicit learning characteristic of evolution in our algorithms, we can create computer programs that learn, and evolve, in uncertain environments. We propose to use evolutionary algorithms to learn to play games of imperfect information – in particular, the game of poker. We describe a new adaptive lear...

متن کامل

Baby Tartanian8: Winning Agent from the 2016 Annual Computer Poker Competition

Imperfect-information games, where players have private information, pose a unique challenge in artificial intelligence. In recent years, Heads-Up NoLimit Texas Hold’em poker, a popular version of poker, has emerged as the primary benchmark for evaluating game-solving algorithms for imperfectinformation games. We demonstrate a winning agent from the 2016 Annual Computer Poker Competition, Baby ...

متن کامل

Computer poker: A review

a r t i c l e i n f o a b s t r a c t The game of poker has been identified as a beneficial domain for current AI research because of the properties it possesses such as the need to deal with hidden information and stochasticity. The identification of poker as a useful research domain has inevitably resulted in increased attention from academic researchers who have pursued many separate avenues...

متن کامل

ASSESSMENT OF MECHANICAL BEHAVIOR OF THE HOWE, PRATT AND BELGIUM WOOD TRUSS TYPE OPTIMIZED BY THE METHOD OF GENETIC ALGORITHMS

This paper presents the study of the optimized bi-dimensional wood structures, truss type, applying the method of genetic algorithms. Assessment is performed by means of a computer program called OPS (Optimization of Plane Structures). The purpose is to meet the optimum geometric configuration taking into account the volume reduction. Different strategies are considered for the positioning of d...

متن کامل

Opponent Modeling in Poker

In recent years much progress has been made on computer gameplay in games of complete information such as chess and go. Computers have surpassed the ability of top chess players and are well on their way to doing so at Go. Games of incomplete information, on the other hand, are far less studied. Despite significant financial incentives, computerized poker players still perform at a level well b...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006